Port Constraints in Hierarchical Layout of Data Flow Diagrams
نویسندگان
چکیده
We present a new application for graph drawing in the context of graphical model-based system design, where manual placing of graphical items is still state-of-the-practice. The KIELER framework aims at improving this by offering novel user interaction techniques, enabled by automatic layout of the diagrams. In this paper we present extensions of the well-known hierarchical layout approach, originally suggested by Sugiyama et al. [22], to support port constraints, hyperedges, and compound graphs in order to layout diagrams of data flow languages. A case study and experimental results show that our algorithm is well suited for application in interactive user interfaces.
منابع مشابه
Drawing layered graphs with port constraints
Complex software systems are often modeled using data flow diagrams, in which nodes are connected to each other through dedicated connection points called ports. The influence a layout algorithm has on the placement of ports is determined by port constraints defined on the corresponding node. In this paper we present approaches for integrating port constraints into the layer-based approach to g...
متن کاملImproved Layout for Data Flow Diagrams with Port Constraints
The automatic generation of graphical views for data flow models and the efficient development of such models require layout algorithms that are able to handle their specific requirements. Examples include constraints on the placement of ports as well as the proper handling of nested models. We present an algorithm for laying out data flow diagrams that improves earlier approaches by reducing t...
متن کاملSpecial issue on diagram aesthetics and layout: Guest editors' introduction
$ Diagrams are an integral part of many visual languages. For diagrams to be an effective and efficient means of communication and visualisation, a layout often has to be produced from data sets that include little or no geometric information. The resulting layout has significant impact on the ability of users to accurately interpret the information contained in the diagrams. Moreover, the choi...
متن کاملCrossing Minimization and Layouts of Directed Hypergraphs with Port Constraints
Many practical applications for drawing graphs are modeled by directed graphs with domain specific constraints. In this paper, we consider the problem of drawing directed hypergraphs with (and without) port constraints, which cover multiple real-world graph drawing applications like data flow diagrams and electric schematics. Most existing algorithms for drawing hypergraphs with port constraint...
متن کاملStress-Minimizing Orthogonal Layout of Data Flow Diagrams with Ports
We present a fundamentally different approach to orthogonal layout of data flow diagrams with ports. This is based on extending constrained stress majorization to cater for ports and flow layout. Because we are minimizing stress we are able to better display global structure, as measured by several criteria such as stress, edge-length variance, and aspect ratio. Compared to the layered approach...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009